Efficient FFT on Torus Multicomputers: A Performance Study
نویسندگان
چکیده
In this paper, the problem of computing a one-dimensional FFT on a c-dimensional torus multicomputer is focused. Different approaches are proposed which differ in the way they use the interconnection network of the torus. One of the approaches is based on the multidimensional index mapping technique for FFT computation. A second approach is based on embedding on the torus a hypercube algorithm for computing the radix-2 Cooley-Tukey FFT. The third approach reduces the communication cost of the hypercube algorithm through the communication pipelining technique. Analytical models are presented to compare the different approaches. Finally, some performance estimates are given to illustrate the comparison.
منابع مشابه
Executing Algorithms with Hypercube Topology on Torus Multicomputers
Many parallel algorithms use hypercubes as the communication topology among their processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fa...
متن کاملAn Efficient Multicast Wormhole Algorithm for Balancing Traffic in 2D Torus Multicomputers
A multicast communication is a significant operation in multicomputers and can be used to support several other collective communication operations. 2D torus network has become increasingly important to multicomputer system design because of its many features. This paper presents an efficient multicast wormhole deadlock-free algorithm that Balance Traffic Load on 2D torus network; hence the nam...
متن کاملEfficient Overlapped Fft Algorithms for Hypercube-connected Multicomputers
In this work, we propose parallel FFT algorithms, for medium-to-coarse grain hypercubeconnected multicomputers, which are more elegant and efficient than the existing ones. The proposed algorithms achieve perfect load-balance for the efficient simplified-butterfly scheme, minimize the communication overhead by decreasing both the number and the volume of concurrent communications. Communication...
متن کاملMathematical Modelling of Torus Networks under Bursty Traffic
Many performance models for interconnection networks in parallel computing systems have been reported under the assumption of non-bursty Poisson arrival process. However, network traffic loads often exhibit bursty nature, which can markedly degrade the system performance. In order to develop a cost-efficient performance evaluation tool, this paper proposes a new analytical model for torus netwo...
متن کاملEmbedding Hypercubes onto Rings and Toruses
Many parallel algorithms use hypercubes as the communication topology among processes. When such algorithms are executed on hypercube multicomputers the communication cost is kept minimum since processes can be allocated to processors in such a way that only communication between neighbor processors is required. However, the scalability of hypercube multicomputers is constrained by the fact tha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007